منابع مشابه
Random stable looptrees*
We introduce a class of random compact metric spaces Lα indexed by α ∈ (1, 2) and which we call stable looptrees. They are made of a collection of random loops glued together along a tree structure, and can informally be viewed as dual graphs of α-stable Lévy trees. We study their properties and prove in particular that the Hausdorff dimension of Lα is almost surely equal to α. We also show tha...
متن کاملPercolation on Random Triangulations and Stable Looptrees
We study site percolation on Angel & Schramm’s Uniform Infinite Planar Triangulation. We compute several critical and near-critical exponents, and describe the scaling limit of the boundary of large percolation clusters in all regimes (subcritical, critical and supercritical). We prove in particular that the scaling limit of the boundary of large critical percolation clusters is the random stab...
متن کاملA Survey on Simulating Stable Random Variables
In general case, Chambers et al. (1976) introduced the following algorithm for simulating any stable random variables $ X/sim(alpha, beta, gamma, delta) $ with four parameters. They use a nonlinear transformation of two independent uniform random variables for simulating an stable random variable... (to continue, click here)
متن کاملRandom stable matchings
The stable matching problem is a prototype model in economics and social sciences where agents act selfishly to optimize their own satisfaction, subject to mutually conflicting constraints. A stable matching is a pairing of adjacent vertices in a graph such that no unpaired vertices prefer each other to their partners under the matching. The problem of finding stable matchings is known as the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2014
ISSN: 1083-6489
DOI: 10.1214/ejp.v19-2732